Triangle Mesh Subdivision with Bounded Curvature and the Convex Hull Property
نویسنده
چکیده
The masks for Loop’s triangle subdivision surface algorithm are modified resulting in surfaces with bounded curvature and the convex hull property. New edge masks are generated by a cubic polynomial mask equation whose Chebyshev coefficients are closely related to the eigenvalues of the corresponding subdivision matrix. The mask equation is found to satisfy a set of smoothness constraints on these eigenvalues. We observe that controlling the root structure of the mask equation is important for deriving subdivision masks with non-negative weights.
منابع مشابه
Smooth Ternary Subdivision of Triangle Meshes
Standard binary subdivision operators may generate surfaces with unbounded curvatures at points corresponding to extraordinary vertices. This defect can be removed by manipulating the eigenvalues of the subdivision operator to impose a bounded curvature spectrum. This procedure may enlarge the support of an extraordinary vertex beyond its two-ring. In the ternary subdivision setting, where mesh...
متن کاملA convex combinatorial property of compact sets in the plane and its roots in lattice theory
K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...
متن کاملConvex Hulls of Bounded Curvature
In this paper, we consider the problem of computing a convex hull of bounded curvature of a set S of points in the plane, i.e. a set containing S and whose boundary is a curve of bounded curvature of minimal length. We prove that, if the radius of the smallest disk that contains S is greater than 1, such a hull is unique. We show that the computation of a convex hull of bounded curvature reduce...
متن کاملBarycentric Mappings
As in the previous chapter, let us denote points in R by p = (x, y, z) and points in R by u = (u, v). An edge is then defined as the convex hull of (or, equivalently, the line segment between) two distinct points and a triangle as the convex hull of three non-collinear points. We will denote edges and triangles in R with capital letters and those in R with small letters, for example, e = [u1,u2...
متن کاملQuad/Triangle Subdivision
In this paper we introduce a new subdivision operator that unifies triangular and quadrilateral subdivision schemes. Designers often want the added flexibility of having both quads and triangles in their models. It is also well known that triangle meshes generate poor limit surfaces when using a quad scheme, while quad-only meshes behave poorly with triangular schemes. Our new scheme is a gener...
متن کامل